A selection lemma

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

متن کامل

Improving the First Selection Lemma in R

We present new bounds on the first selection lemma in R. This makes progress on the open problems of Bukh, Matoušek and Nivash [BMN08] and Boros-Füredi [BF84] for the three-dimensional case, improving the previously best result of Wagner [Wag03]. While our results narrow the gap between the current best lower and upper bounds, they do not settle this question. However, they indicate that it is ...

متن کامل

Lemma selection in domain specific computational lexica - some specific problems

This paper describes the lemma selection process of a Danish computational lexicon, the STO project, for domain specific language and focuses on some specific problems encountered during the lemma selection process. After a short introduction to the STO project and an explanation of why the lemmas are selected from a corpus and not chosen from existing dictionaries, the lemma selection process ...

متن کامل

Radó Selection Lemma and Other Combinatorial Statements Uniformly Proved

We present an uniform method of proving some combinatorial statements of Radó Selection Lemma type. They mainly come from Cowen [1,2,3].

متن کامل

A Discrete Farkas Lemma

Given A ∈ Zm×n and b ∈ Zm, we consider the issue of existence of a nonnegative integral solution x ∈ Nn to the system of linear equations Ax = b. We provide a discrete and explicit analogue of the celebrated Farkas lemma for linear systems in Rn and prove that checking existence of integral solutions reduces to solving an explicit linear programming problem of fixed dimension, known in advance.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1971

ISSN: 0097-3165

DOI: 10.1016/0097-3165(71)90021-5